P systems with minimal insertion and deletion
نویسندگان
چکیده
منابع مشابه
P systems with minimal insertion and deletion
1 IEC, Department of Information Engineering, Graduate School of Engineering Hiroshima University, Higashi-Hiroshima 739-8527 Japan 2 Research Group on Mathematical Linguistics, Rovira i Virgili University Av. Catalunya, 35, Tarragona 43002 Spain [email protected] 3 Institute of Mathematics and Computer Science, Academy of Sciences of Moldova Academiei 5, Chişinău MD-20...
متن کاملOn minimal context-free insertion-deletion systems
We investigate the class of context-free insertion-deletion systems. It is known that such systems are universal if the length of the inserted/deleted string is at least three. We show that if this length is bounded to two, then the obtained systems are not universal. We characterise the obtained class and we introduce a new complexity measure for insertion-deletion systems, which permits a bet...
متن کاملArray Insertion and Deletion P Systems
Let d ∈ N; then a d-dimensional array A over an alphabet V is a function A : Z → V ∪ {#}, where shape (A) = { v ∈ Z | A (v) 6= # } is finite and # / ∈ V is called the background or blank symbol. The set of all d-dimensional arrays over V is denoted by V ∗d. For v ∈ Z, v = (v1, . . . , vd), the norm of v is ‖v‖ = max {|vi| | 1 ≤ i ≤ d}. The translation τv : Z → Z is defined by τv (w) = w+ v for ...
متن کاملRestricted Insertion-Deletion Systems
In the past few years several paper showed, that various generative mechanisms in formal language theory that used context-dependent insertions and deletions are capable of generating any recursively enumerable languages [1, 2, 3, 4, 5, 6, 7, 8, 9]. Since such systems are also models of molecular computing, for practical reasons it is important to examine these systems in a restricted case, in ...
متن کاملMatrix insertion-deletion systems
In this article, we consider for the first time the operations of insertion and deletion working in a matrix controlled manner. We show that, similarly as in the case of context-free productions, the computational power is strictly increased when using a matrix control: computational completeness can be obtained by systems with insertion or deletion rules involving at most two symbols in a cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.08.025